Mixed integer programming optimization models for brachytherapy treatment planning
نویسندگان
چکیده
Mixed integer programming is proposed as an approach for generating treatment plans for brachytherapy. Two related but distinct, mixed integer programming models are tested on data from eight prostate cancer patients. The results demonstrate that in some cases, "good" treatment plans can be obtained in less than five CPU minutes.
منابع مشابه
Exact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment
This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...
متن کاملMixed Integer Programming Approaches to Treatment Planning for Brachytherapy - Application to Permanent Prostate Implants
Mixed integer programming models and computational strategies developed for treatment planning optimization in brachytherapy are described. The problem involves the designation of optimal placement of radioactive sources (seeds) inside a tumor site. Two MIP models are described. The resulting MIP instances are difficult to solve, due in large part to dense constraint matrices with large dispari...
متن کاملA hybrid simulated annealing linear programming approach for treatment planning in HDR brachytherapy with dose volume constrai
This paper presents a hybrid approach for developing radiation plans for high dose rate brachytherapy in cancer treatment. In order to take care of the computationally hard dose volume constraints, linear programming (LP) is alternated with heuristic neighborhood search which allows for a quick generation of multiple feasible treatment plans. The simulated annealing neighborhood search is guide...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملMixed integer programming improves comprehensibility and plan quality in inverse optimization of prostate HDR brachytherapy.
Current inverse treatment planning methods that optimize both catheter positions and dwell times in prostate HDR brachytherapy use surrogate linear or quadratic objective functions that have no direct interpretation in terms of dose-volume histogram (DVH) criteria, do not result in an optimum or have long solution times. We decrease the solution time of the existing linear and quadratic dose-ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Proceedings : a conference of the American Medical Informatics Association. AMIA Fall Symposium
دوره شماره
صفحات -
تاریخ انتشار 1997